Partially Ordered Two-Way Büchi Automata
نویسندگان
چکیده
We introduce partially ordered two-way Büchi automata and characterize their expressive power in terms of fragments of first-order logic FO[<]. Partially ordered two-way Büchi automata are Büchi automata which can change the direction in which the input is processed with the constraint that whenever a state is left, it is never re-entered again. Nondeterministic partially ordered two-way Büchi automata coincide with the first-order fragment Σ2. Our main contribution is that deterministic partially ordered twoway Büchi automata are expressively complete for the first-order fragment ∆2. As an intermediate step, we show that deterministic partially ordered two-way Büchi automata are effectively closed under Boolean operations. A small model property yields coNP-completeness of the emptiness problem and the inclusion problem for deterministic partially ordered two-way Büchi automata.
منابع مشابه
Alternation Removal in Büchi Automata
Alternating automata play a key role in the automata-theoretic approach to specification, verification, and synthesis of reactive systems. Many algorithms on alternating automata, and in particular, their nonemptiness test, involve removal of alternation: a translation of the alternating automaton to an equivalent nondeterministic one. For alternating Büchi automata, the best known translation ...
متن کاملExtended Temporal Logic Revisited
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should extend linear temporal logic with the ability to specify all !-regular properties. Also, designers, who are familiar with finite-state machines, prefer extensions based on automata than these based on fixed points or propos...
متن کاملBüchi VASS recognise w-languages that are Sigma^1_1 - complete
This short note exhibits an example of a Σ1-complete language that can be recognised by a one blind counter Büchi automaton (or equivalently a Büchi VASS with only one place). In this work we study the topological complexity of ω-languages recognised by vector addition systems with states equipped with Büchi acceptance condition (Büchi VASS). This model corresponds, from the automata theoretic ...
متن کاملLinear weak alternating automata and the model checking problem
Abstract. Automata-based model checking is a widely used approach towards software model checking. Traditionally, nondeterministic Büchi automata are used to represent the temporal logic property to be checked. We take a look at a special kind of alternating automata, the linear weak alternating automata. They can be constructed from LTL formula in an elegant way in linear time. The emptiness c...
متن کاملThree Lectures on Automatic Structures
This paper grew out of three tutorial lectures on automatic structures given at the Logic Colloquium 2007 in Wroc law (Poland). The paper will follow the outline of the tutorial lectures, supplementing some material along the way. We discuss variants of automatic structures related to several models of computation: word automata, tree automata, Büchi automata, and Rabin automata. Word automata ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 22 شماره
صفحات -
تاریخ انتشار 2010